Exact and approximate bandwidth

Exact and Approximate Bandwidth

In this paper we gather several improvements in the field of exact and approximate exponential-time algorithms for the BANDWIDTH problem. For graphs with treewidth t we present a O(n2) exact algorithm. Moreover for the same class of graphs we introduce a subexponential constant-approximation scheme – for any α > 0 there exists a (1 + α)-approximation algorithm running in O(exp(c(t + √ n/α) log ...

Exact and approximate . . .

Approximate Versus Exact Equilibria∗

This paper develops theoretical foundations for an error analysis of approximate equilibria in dynamic stochastic general equilibrium models with heterogeneous agents and incomplete financial markets. While there are several algorithms which compute prices and allocations for which agents’ first order conditions are approximately satisfied (‘approximate equilibria’), there are few results on ho...

Quantum Theory: Exact or Approximate?

Quantum mechanics has enjoyed a multitude of successes since its formulation in the early twentieth century. It has explained the structure and interactions of atoms, nuclei, and subnuclear particles, and has given rise to revolutionary new technologies. At the same time, it has generated puzzles that persist to this day. These puzzles are largely connected with the role that measurements play ...

Approximate and Exact Deterministic Parallel Selection

The selection problem of Bise n is, given a. set of n elements drawn !rom an ordered universe and an integer r with 1 ~ r ~ n, to identify the rth smallest element in the set. We study approximate and exact selection on deterministic concurrent-read concurrent-write parallel RAMs, where approximate selection with relative accuracy ~ > 0 asks for any element whose true rank difi'ers !rom r by at...